Isolation of plant growth-inhibiting compounds from acidulocompost; a garbage compost processed under thermoacidophilic conditions

Poster Sessio

Performance of a Low Noise Front-end ASIC for Si/CdTe Detectors in Compton Gamma-ray Telescope

Compton telescopes based on semiconductor technologies are being developed to explore the gamma-ray universe in an energy band 0.1--20 MeV, which is not well covered by the present or near-future gamma-ray telescopes. The key feature of such Compton telescopes is the high energy resolution that is crucial for high angular resolution and high background rejection capability. The energy resolution around 1 keV is required to approach physical limit of the angular resolution due to Doppler broadening. We have developed a low noise front-end ASIC (Application-Specific Integrated Circuit), VA32TA, to realize this goal for the readout of Double-sided Silicon Strip Detector (DSSD) and Cadmium Telluride (CdTe) pixel detector which are essential elements of the semiconductor Compton telescope. We report on the design and test results of the VA32TA. We have reached an energy resolution of 1.3 keV (FWHM) for 60 keV and 122 keV at 0 degree C with a DSSD and 1.7 keV (FWHM) with a CdTe detector.Comment: 6 pages, 7 figures, IEEE style file, to appear in IEEE Trans. Nucl. Sc

Effects of silicate fertilizer application on growth and yield of organically managed rice

Poster Sessio

Compound basis arising from the basic A1(1)A^{(1)}_{1}-module

A new basis for the polynomial ring of infinitely many variables is constructed which consists of products of Schur functions and Q-functions. The transition matrix from the natural Schur function basis is investigated.Comment: 12 page

An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths

A chordless cycle (induced cycle) $C$ of a graph is a cycle without any chord, meaning that there is no edge outside the cycle connecting two vertices of the cycle. A chordless path is defined similarly. In this paper, we consider the problems of enumerating chordless cycles/paths of a given graph $G=(V,E),$ and propose algorithms taking $O(|E|)$ time for each chordless cycle/path. In the existing studies, the problems had not been deeply studied in the theoretical computer science area, and no output polynomial time algorithm has been proposed. Our experiments showed that the computation time of our algorithms is constant per chordless cycle/path for non-dense random graphs and real-world graphs. They also show that the number of chordless cycles is much smaller than the number of cycles. We applied the algorithm to prediction of NMR (Nuclear Magnetic Resonance) spectra, and increased the accuracy of the prediction